/**
 * @file AbstractGraph.java
 *
 * @author Usuario
 * @version
 * @date 23/12/2010
 */
package graph;

import java.util.Iterator;

import map.Map;
import set.Set;

/**
 * @author Usuario
 *
 */
public class AbstractGraph {
	private boolean adj[][];
	private long size;
	
	public AbstractGraph(long[] elem){
		
	}
	
	public boolean addEdge(long v, long u){
		return false;
	}
	
	public boolean removeEdge(long v, long u){
		return false;
	}
	
	public AbstractGraph addVertex(long elem){
		return null;
	}
	
	public AbstractGraph remove(long node){
		return null;	
	}
	
	public AbstractGraph remove(long[] node){
		return null;	
	}
	
	public AbstractGraph getVertexSet(){
		return null;
	}
	
	public AbstractGraph neigboorhood(long v){
		return null;
		
	}
	
	public long degree(long v){
		return 0;
	}
	
	public boolean isNeigboor(long v, long u){
		return false;
	}
	
	public long size(){
		return 0;	
	}
	
	public long numedges(){
		return 0;	
	}
	
	public long numVertex(){
		return 0;
	}
	
	public Iterator<Long> deepFirtSearch(){
		return null;	
	}
	
	public Iterator<Long> branchFirtSearch(){
		return null;	
	}
	
	public Iterator<Long> bestFirtSearch(Evaluetor value){
		return null;	
	}
	
	public boolean isEmpty(){
		return false;	
	}
	
	public boolean isBipartite(){
		return false;
	}
	
	public boolean isEulerian(){
		return false;
	}
	
	public Set<Set<Long>> getBipartitions(){
		return null;	
	}
	
	public Set<Long> getMaximalClique(){
		return null;
	}
	
	public Set<Long> getMaximalStableSet(){
		return null;
	}
	
	public Map<Long, Long> getColoring(){
		return null;
	}
}
